Isomorphisms of row and column finite matrix rings
نویسندگان
چکیده
منابع مشابه
Low-Rank Matrix Recovery from Row-and-Column Affine Measurements
We propose and study a row-and-column affine measurement scheme for low-rank matrix recovery. Each measurement is a linear combination of elements in one row or one column of a matrix X . This setting arises naturally in applications from different domains. However, current algorithms developed for standard matrix recovery problems do not perform well in our case, hence the need for developing ...
متن کاملBreaking Row and Column Symmetries in Matrix Models
We identify an important class of symmetries in constraint programming, arising from matrices of decision variables where rows and columns can be swapped. Whilst lexicographically ordering the rows (columns) breaks all the row (column) symmetries, lexicographically ordering both the rows and the columns fails to break all the compositions of the row and column symmetries. Nevertheless, our expe...
متن کاملNon-negative matrix factorization with fixed row and column sums
In this short note, we focus on the use of the generalized Kullback–Leibler (KL) divergence in the problem of non-negative matrix factorization (NMF). We will show that when using the generalized KL divergence as cost function for NMF, the row sums and the column sums of the original matrix are preserved in the approximation. We will use this special characteristic in several approximation prob...
متن کاملDistribution Row Block Row Cyclic Column Block Column Cyclic
[PIER89] P. Pierce, " A concurrent file system for a highly parallel mass storage subsystem " ,
متن کاملOn parallelizing matrix multiplication by the column-row method
We consider the problem of sparse matrix multiplication by the column row method in a distributed setting where the matrix product is not necessarily sparse. We present a surprisingly simple method for “consistent” parallel processing of sparse outer products (column-row vector products) over several processors, in a communication-avoiding setting where each processor has a copy of the input. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1997
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-97-03849-5